High Bandwidth and Highly Available Packet Buffer Design Using Multi-Retention Time MRAM

نویسندگان

چکیده

Significant challenges are posed in the design of routers and switches by explosive growth internet traffic stringent requirements for high availability research area computer networks. Ensuring both performance system is crucial. To achieve this, recent advancements have turned to utilization non-volatile memories, such as magnetic RAM (MRAM) phase-change memory (PCM), routing lookup tables packet buffers switches. However, use memories show limitations scaling with respect bandwidth capacity. With increasing clock speed IO bus, high-capacity like PCM exhibit limited scalability since accessing cells array does not significant improvement. Meanwhile, attempts enhance capacity low-access-latency spin-transfer torque MRAM (STT-MRAM) through smaller cell sizes result an adverse impact on write time. The goal this study a buffer that can provide ensure availability. multi-retention time MRAM-based presented, along mapping method, which aims overcome challenge while ensuring two-tier (TT-PB) structure implements small/fast combined large/slow MRAM, outperforms baseline MRAM/PCM hybrid memory-based up 16% 58% 1.6 3.2 GHz bus clocks. For input, internet-mix utilized depict realistic traffic. Moreover, proposed latency-aware (MR-PB) consists short long retention partitions. It identifies buffering latency demands various packets writes into partitions sufficient accommodate required latencies, thereby achieving optimal each packet. scheme, additional speedup 5.27% achieved over TT-PB.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimating Available Bandwidth Using Packet Pair Probing

The packet pair mechanism has been shown to be a reliable method to measure the bottleneck link bandwidth of a network path. However, the use of packet pairs to measure available bandwidth has had more mixed results. In this paper we study how packet pairs and packet trains can be used to estimate the available bandwidth on a network path. As a starting point for our study, we construct the gap...

متن کامل

Ultra High Speed Packet Buffering using “Parallel Packet Buffer”

Modern switches and routers often use dynamic RAM (DRAM) in order to provide large buffer storage space. However, the effective bandwidth of DRAM is frequently a limiting factor in the design of high-speed switches and routers. The focus of this paper is to introduce a packet-buffering architecture called the parallel packet buffering (PPB), which increases the effective memory bandwidth signif...

متن کامل

Real-Time Multi-path Tracking of Probabilistic Available Bandwidth

Applications such as traffic engineering and network provisioning can greatly benefit from knowing, in real time, what is the largest input rate at which it is possible to transmit on a given path without causing congestion. We consider a probabilistic formulation for available bandwidth where the user specifies the probability of achieving an output rate almost as large as the input rate. We a...

متن کامل

Accelerated Multi-Phase Packet Classification Architecture Using Internal Buffer

Traditionally, Internet routers only perform best effort service by processing each incoming packet in the same manner. With the emergence of new applications, packet classification is essential for supporting advanced Internet applications, such as network security and QoS provisioning. As the packet classification on multiple-fields is a difficult and time consuming problem, Internet routers ...

متن کامل

Optimal Buffer and Bandwidth Allocation using Effective Bandwidth

We consider a single node which multiplexes a large number of traffic sources. We restrict ourselves to consideration of aggregates of i.i.d. flows that can modelled using effective bandwidth results. We are concerned with the amount of buffer and bandwidth that should be allocated to this aggregate, under a maximum overflow probability constraint. Unlike previous approaches which assume that t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3312637